On a Class of Maximal Reflexive Θ-graphs Generated by Smith Graphs
نویسنده
چکیده
A simple graph is said to be reflexive if its second largest eigenvalue does not exceed 2. The property λ2 ≤ 2 is a hereditary one, i.e. any induced subgraph of a reflexive graph preserves this property and that is why reflexive graphs are usually represented by maximal graphs within a given class. Bicyclic graphs whose two cycles have a common path are called θ-graphs. We consider classes of maximal reflexive θ-graphs arising from a Smith tree and a cycle attached to it in a specified way.
منابع مشابه
Decomposition of Smith graphs in maximal reflexive cacti
The spectrum of a graph is the family of eigenvalues of its (0, 1) adjacency matrix.A simple graph is reflexive if its second largest eigenvalue 2 does not exceed 2. The graphic property 2 2 is a hereditary one, i.e. every induced subgraph of a reflexive graph preserves this property and that is why reflexive graphs are usually represented through maximal graphs. Cacti, or treelike graphs, are ...
متن کاملSome Results on the Maximal 2-Rainbow Domination Number in Graphs
A 2-rainbow dominating function ( ) of a graph is a function from the vertex set to the set of all subsets of the set such that for any vertex with the condition is fulfilled, where is the open neighborhood of . A maximal 2-rainbow dominating function on a graph is a 2-rainbow dominating function such that the set is not a dominating set of . The weight of a maximal is the value . ...
متن کاملOn the saturation number of graphs
Let $G=(V,E)$ be a simple connected graph. A matching $M$ in a graph $G$ is a collection of edges of $G$ such that no two edges from $M$ share a vertex. A matching $M$ is maximal if it cannot be extended to a larger matching in $G$. The cardinality of any smallest maximal matching in $G$ is the saturation number of $G$ and is denoted by $s(G)$. In this paper we study the saturation numbe...
متن کاملThe maximal total irregularity of some connected graphs
The total irregularity of a graph G is defined as 〖irr〗_t (G)=1/2 ∑_(u,v∈V(G))▒〖|d_u-d_v |〗, where d_u denotes the degree of a vertex u∈V(G). In this paper by using the Gini index, we obtain the ordering of the total irregularity index for some classes of connected graphs, with the same number of vertices.
متن کاملLine graphs associated to the maximal graph
Let $R$ be a commutative ring with identity. Let $G(R)$ denote the maximal graph associated to $R$, i.e., $G(R)$ is a graph with vertices as the elements of $R$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $R$ containing both. Let $Gamma(R)$ denote the restriction of $G(R)$ to non-unit elements of $R$. In this paper we study the various graphi...
متن کامل